A Continuous Approximation to the Generalized Schur Decomposition
نویسندگان
چکیده
We consider the problem of approximating the generalized Schur decomposition of a matrix pencil A XB by a family of differentiable orthogonal transformations. It is shown that when B is nonsingular this approach is feasible and can be fully expressed as an autonomous differential system. When B is singular, we show that the location of zero diagonal entries of B affects the feasibility of such an approach, and hence we conclude that at least the QZ algorithm cannot be extended continuously.
منابع مشابه
Approximation of Optimal Interface Boundary Conditions for Two-Lagrange Multiplier FETI Method
Interface boundary conditions are the key ingredient to design efficient domain decomposition methods. However, convergence cannot be obtained for any method in a number of iterations less than the number of subdomains minus one in the case of a one-way splitting. This optimal convergence can be obtained with generalized Robin type boundary conditions associated with an operator equal to the Sc...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملA Schur Method for Low-Rank Matrix Approximation
The usual way to compute a low-rank approximant of a matrix H is to take its singular value decomposition (SVD) and truncate it by setting the small singular values equal to 0. However, the SVD is computationally expensive. This paper describes a much simpler generalized Schur-type algorithm to compute similar low-rank approximants. For a given matrix H which has d singular values larger than ε...
متن کاملDecomposition of supra soft locally closed sets and supra SLC-continuity
In this paper, we introduce two different notions of generalized supra soft sets namely supra A--soft sets and supra soft locally closed sets in supra soft topological spaces, which are weak forms of supra open soft sets and discuss their relationships with each other and other supra open soft sets [{it International Journal of Mathematical Trends and Technology} (IJMTT), (2014) Vol. 9 (1):37--...
متن کاملA Schur Method for Low-rank Matrix Approximation∗ Alle-jan Van Der Veen
The usual way to compute a low-rank approximant of a matrix H is to take its singular value decomposition (SVD) and truncate it by setting the small singular values equal to 0. However, the SVD is computationally expensive. This paper describes a much simpler generalized Schur-type algorithm to compute similar low-rank approximants. For a given matrix H which has d singular values larger than ε...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1986